Scheduling Flows With Multiple Service Frequency Constraints
نویسندگان
چکیده
منابع مشابه
Technique Report: Scheduling Flows with Multiple Service Frequency Constraints
With the fast development of wireless technologies, wireless applications have invaded various areas in people’s lives with a wide range of capabilities. Guaranteeing Quality-ofService (QoS) is the key to the success of those applications. One of the QoS requirements, service frequency, is very important for tasks including multimedia transmission in the Internet of Things. A service frequency ...
متن کاملPeriodic Scheduling with Service Constraints
We consider the problem of servicing a number of objects in a discrete time environment. In each period, we may select an object that will receive a service in the period. Each time an object is serviced, we incur a servicing cost dependent on the time since the object’s last service. Problems of this type appear in many contexts, e.g., multiproduct lot-sizing, machine maintenance, and several ...
متن کاملPacket Scheduling with Window Service Constraints
This paper considers the scheduling problem that minimizes the average response time of two jobs subject to window constraints. By window constraints, we mean that within a fixed time interval, the server can serve at mostW packets from one job, where W is called the window size of the job. This paper investigates the effects of the window constraints in detail, and derives the optimal policy. ...
متن کاملReal-Time Scheduling with Quality of Service Constraints
Can the introduction of traac classes improve upon the performance of ATM networks? We investigate this issue within the framework provided by a class of networks that guarantees quality of service. To provide a meaningful comparison we deene the concept of schedulable region, a region in the space of loads for which the quality of service is guaranteed. We show the dependence of the schedulabl...
متن کاملScheduling Multiple Flows on Parallel Disks
We examine the problem of scheduling concurrent independent flows on multiple-disk I/O storage systems. Two models are considered: in the shared buffer model the memory buffer is shared among all the disks, while in the partitioned buffer model each flow has a private buffer. For the parallel disk model with d > 1 disks it is shown that the problem of minimizing the schedule length of n > 2 con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Internet of Things Journal
سال: 2017
ISSN: 2327-4662
DOI: 10.1109/jiot.2016.2577630